Geographical Embedding of Scale-Free Networks
نویسندگان
چکیده
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scalefree networks embedded by the suggested algorithm are studied both analytically and through simulations. Our findings indicate dramatic changes in the embedded networks, in comparison to their off-lattice counterparts, and call into question the applicability of off-lattice scale-free models to realistic, everyday-life networks.
منابع مشابه
Epidemic spreading in lattice-embedded scale-free networks
We study geographical effects on the spread of diseases in lattice-embedded scalefree networks. The geographical structure is represented by the connecting probability of two nodes that is related to the Euclidean distance between them in the lattice. By studying the standard Susceptible-Infected model, we found that the geographical structure has great influences on the temporal behavior of ep...
متن کاملScale-free networks on lattices.
We suggest a method for embedding scale-free networks, with degree distribution Pk approximately k(-lambda), in regular Euclidean lattices accounting for geographical properties. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to a (Euclidean) distance xi which...
متن کاملScale-free networks embedded in fractal space
The impact of an inhomogeneous arrangement of nodes in space on a network organization cannot be neglected in most real-world scale-free networks. Here we propose a model for a geographical network with nodes embedded in a fractal space in which we can tune the network heterogeneity by varying the strength of the spatial embedding. When the nodes in such networks have power-law distributed intr...
متن کاملRepresentation Learning for Scale-free Networks
Network embedding aims to learn the low-dimensional representations of vertexes in a network, while structure and inherent properties of the network is preserved. Existing network embedding works primarily focus on preserving the microscopic structure, such as the firstand second-order proximity of vertexes, while the macroscopic scale-free property is largely ignored. Scale-free property depic...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003